Entropy and the timing capacity of discrete queues

Entropy and the timing capacity of discrete queues

Queueing systems which map Poisson input processes to Poisson output processes have been well-studied in classical queueing theory. This paper considers two discretetime queues whose analogs in continuous-time possess the Poisson-in-Poisson-out property. It is shown that when packets arriving according to an arbitrary ergodic stationary arrival process are passed through these queueing systems,...

The Information-Theoretic Capacity of Discrete-Time Queues

The information-theoretic capacity of continuous-time single-server queues has been analyzed recently by Anantharam and Verdu 1]. They observed that information is transmitted through a queue not only by the contents of the packets but also by the arrival times of these packets. The sequence of packet interarrival times can be used as a code to convey information to the receiver, who observes t...

the study of bright and surface discrete cavity solitons dynamics in saturable nonlinear media

امروزه سالیتون ها بعنوان امواج جایگزیده ای که تحت شرایط خاص بدون تغییر شکل در محیط منتشر می-شوند، زمینه مطالعات گسترده ای در حوزه اپتیک غیرخطی هستند. در این راستا توجه به پدیده پراش گسسته، که بعنوان عامل پهن شدگی باریکه نوری در آرایه ای از موجبرهای جفت شده، ظاهر می گردد، ضروری است، زیرا سالیتون های گسسته از خنثی شدن پراش گسسته در این سیستم ها بوسیله عوامل غیرخطی بوجود می آیند. گسستگی سیستم عامل...

On the Discrete Cumulative Residual Entropy

Bounds on the Sum Timing Capacity of Single-server Queues with Multiple Input and Output Terminals

We consider an exponential server queue accessed by many different flows. It is assumed that the source and destination information of each flow is available in the packet. We compute upper and lower bounds on the sum timing capacity of this channel. We derive asymptotically tight lower and upper bounds on the sum timing capacity for discrete-time queues with general service-time distributions....